On the Bandpass problem
نویسنده
چکیده
The complexity of the Bandpass problem is re-investigated. Specifically, we show that the problem with any fixed bandpass number B ≥ 2 is NP-hard. Next, a row stacking algorithm is proposed for the problem with three columns, which produces a solution that is at most 1 less than the optimum. For the special case B = 2, the row stacking algorithm guarantees an optimal solution. On approximation, for the general problem, we present an O(B)-algorithm, which reduces to a 2-approximation algorithm for the special case B = 2.
منابع مشابه
Fractal Bandpass Filter Using Y-shaped Dual-Mode Resonator for C-Band Receiver (Research Note)
In this study, a fractal, Y-shaped dual-mode resonator bandpass filter (BPF) with input-output cross-coupling is introduced. A parallel-coupling feed structure with a cross coupling has been used to generate two transmission zeroes (TZs) near the lower and upper cutoff frequency that can effectively improve the passband edge selectivity. Also, a fractal shaped based on conventional diamond and ...
متن کاملA Compact Wide Bandpass Filter based on Substrate Integrated Waveguide (SIW) Structure
In this pare, a wideband three-order bandpass filter (BPF) is proposed. The proposed wideband filter is designed using the substrate integrated waveguide (SIW) structure by loading T-shape slots. A BPF with two resonators is formed by etching T-shape slots with different size on the top metal plane of the SIW structure. The filter is investigated with the theory of coupled resonator circuits. T...
متن کاملA Compact Ultra-Wideband Bandpass Filter with Sharp-Rejection using Complementary Split Ring Resonators
A compact and sharp-rejection ultra-wideband (UWB) microstrip band-pass filter (BPF) is developed using of left handed metamaterials realized by complementary split ring resonator (CSRR). Moreover, proposed structure consists of two doublets parallel coupling gaps at each side of a microstrip ring. In comparison with some other filters, this structure shows a significantly wider passband due to...
متن کاملThe bandpass problem: combinatorial optimization and library of problems
A combinatorial optimization problem, called the Bandpass Problem, is introduced. Given a rectangular matrix A of binary elements {0,1} and a positive integer B called the Bandpass Number, a set of B consecutive non-zero elements in any column is called a Bandpass. No two bandpasses in the same column can have common rows. The Bandpass problem consists of finding an optimal permutation of rows ...
متن کاملAn Adaptive Self-adjusting Bandwidth Bandpass Filter without IIR Bias
In this paper we introduce a simple, computationally inxepentsive, adaptive recursive structure for enhancing bandpass signals highly corrupted by broad-band noise. This adaptive algorithm, enhancing input signals, enables us to estimate the center frequency and the bandwidth of the input signal. In addition, an important feature of the proposed structure is that the conventional bias existing ...
متن کاملAn Adaptive Self-adjusting Bandwidth Bandpass Filter without IIR Bias
In this paper we introduce a simple, computationally inxepentsive, adaptive recursive structure for enhancing bandpass signals highly corrupted by broad-band noise. This adaptive algorithm, enhancing input signals, enables us to estimate the center frequency and the bandwidth of the input signal. In addition, an important feature of the proposed structure is that the conventional bias existing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 22 شماره
صفحات -
تاریخ انتشار 2011